A Computation with the Connes–Thom Isomorphism
نویسندگان
چکیده
منابع مشابه
Computation of Isomorphism Classes of /»-Groups
p-groups may be classified by splitting the groups up into classes having the same commutator relations (isoclinism classes) and then determining the nonisomorphic groups in each class. This paper reduces the problem of determining the isomorphism classes to that of finding the equivalence classes of a set of matrices under some equivalence relation. A computer is used to find the equivalence c...
متن کاملA Computation of Partial Isomorphism Rank on Ordinal Structures
We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.
متن کاملDistributed Computation, the Twisted Isomorphism, and Auto-Poiesis
1 This paper presents a synchronization-based, multi-process computational model of anticipatory systems called the Phase Web. It describes a self-organizing paradigm that explicitly recognizes and exploits the existence of a boundary between inside and outside, accepts and exploits intentionality, and uses explicit self-reference to describe eg. auto-poiesis. The model explicitly connects comp...
متن کاملGraph Isomorphism Testing Without Full Automorphism Group Computation∗
In this paper we present an algorithm for testing the isomorphism of two graphs. The algorithm works in three steps. First, it builds a sequence of partitions on the vertices of one of the graphs. Then, it looks for some automorphisms in that graph. Finally, it uses backtracking to try to find another sequence of partitions for the second graph that is compatible with that for the first graph. ...
متن کاملRectangular Network Reliability Computation Based on Isomorphism Determination
To decrease repeated computations and improve efficiency, this paper presents a rectangular network reliability computation method based on isomorphism determination. According to the special structure of rectangular network, 2 sorts of subnets are defined for 2×m network, and n sorts of subnets are defined for n×m network. Furthermore, a hash table is designed to record the OBDD (Ordered Binar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2015
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2015-048-6